GATE CSE 2020
Q31.
Consider the language L=\{a^n|n\geq 0\}\cup \{a^nb^n|n\geq 0\} and the following statements. I. L is deterministic context-free. II. L is context-free but not deterministic context-free. III. L is not LL(k) for any k. Which of the above statements is/are TRUE?Q32.
Consider the following set of processes, assumed to have arrived at time 0. Consider the CPU scheduling algorithms Shortest Job First (SJF) and Round Robin (RR). For RR, assume that the processes are scheduled in the order P_1,P_2,P_3,P_4. If the time quantum for RR is 4 ms, then the absolute value of the difference between the average turnaround times (in ms) of SJF and RR (round off to 2 decimal places is_______Q33.
Consider the following five disk five disk access requests of the form (request id, cylinder number) that are present in the disk scheduler queue at a given time. (P,155),(Q,85),(R,110),(S,30),(T,115) Assume the head is positioned at cylinder 100. The scheduler follows Shortest Seek Time First scheduling to service the requests. Which one of the following statements is FALSE?Q34.
Consider the Boolean function z(a,b,c). Which one of the following minterm lists represents the circuit given above?Q35.
Which one of the following is used to represent the supporting many-one relationships of a weak entity set in an entity-relationship diagram?Q36.
Graph G is obtained by adding vertex s to K_{3,4} and making s adjacent to every vertex of K_{3,4}. The minimum number of colours required to edge-colour G is _______Q37.
Let G be a group of 35 elements. Then the largest possible size of a subgroup of G other than G itself is _______.Q40.
Consider a double hashing scheme in which the primary hash function is h_1(k)=k\; mod \; 23, and the secondary hash function is h_2(k)=1+(k\; mod \; 19). Assume that the table size is 23. Then the address returned by probe 1 in the probe sequence (assume that the probe sequence begins at probe 0) for key value k=90 is_____________.